Model Theory 290A: Automorphisms
نویسنده
چکیده
This term paper is a summary of topological properties of automorphisms and modeltheoretic consequences on countable structures. It is based on Section 4.1 of [1].
منابع مشابه
Many Generic Automorphisms
Given a theory T , one may add a new unary function symbol σ to the language and add axioms to T asserting that σ is an automorphism. The model theory of generic automorphisms is the study of the model companion of the resulting theory Tσ . In this paper, we study theories equipped with more than one generic automorphism by exploring when model companions exist for such theories. In particular,...
متن کاملA short proof of the maximum conjecture in CR dimension one
In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...
متن کاملEndomorphisms and automorphisms of locally covariant quantum field theories
In the framework of locally covariant quantum field theory, a theory is described as a functor from a category of spacetimes to a category of ∗-algebras. It is proposed that the global gauge group of such a theory can be identified as the group of automorphisms of the defining functor. Consequently, multiplets of fields may be identified at the functorial level. It is shown that locally covaria...
متن کاملThe Strict Order Property and Generic Automorphisms
If T is an model complete theory with the strict order property, then the theory of the models of T with an automorphism has no model companion.
متن کاملFrom Bounded Arithmetic to Second Order Arithmetic via Automorphisms
In this paper we examine the relationship between automorphisms of models of I∆0 (bounded arithmetic) and strong systems of arithmetic, such as PA, ACA0 (arithmetical comprehension schema with restricted induction), and Z2 (second order arithmetic). For example, we establish the following characterization of PA by proving a “reversal” of a theorem of Gaifman: Theorem. The following are equivale...
متن کامل